Search for Three forged Coins
نویسنده
چکیده
We give a simple and efficient sequential weighing algorithm to search for three forged coins, with an asymptotic rate of 0.57, which is better than that (0.46) of the known static algorithm given by Lindström. Then we construct from the weighing algorithm an zero-error code for the three-user Multiple Access Adder Channel with feedback with rate 0.57.
منابع مشابه
0 Search for Three forged Coins
We give a simple and efficient sequential weighing algorithm to search for three forged coins, with an asymptotic rate of 0.57, which is better than that (0.46) of the known static algorithm given by Lindström. Then we construct from the weighing algorithm an zero-error code for the three-user Multiple Access Adder Channel with feedback with rate 0.57.
متن کاملMultiple Quantum Walkers on the Line Using Hybrid Coins: a Possible Tool for Quantum Search
In this paper discrete quantum walks with different coins used for odd and even time steps are studied. These coins are called hybrid. The calculation results are compared with the most frequently used coin, the Hadamard transform. Furthermore, quantum walks on the line which involve two or more quantum walkers with hybrid coins are studied. Quantum walks with entangled walkers and hybrid coins...
متن کاملRandomised Mutual Search
We study the efficiency of randomised solutions to the mutual search problem of finding k agents distributed over n nodes. For a restricted class of so-called linear randomised mutual search algorithms we derive a lower bound of k−1 k+1 (n+1) expected calls in the worst case. A randomised algorithm in the shared-coins model matching this bound is also presented. Finally we show that in general ...
متن کاملStudy and Simulation of Shot peening Effect on Fatigue Life of a Powder Forged Connecting rod
Shot peening applies a residual compressive stress field (RCSF) on the surface of parts. It also shifts “crack nucleation sites” to sub-surface locations. A nondestructive method of measuring the stresses, Sin2ψ was utilized here and the stress values introduced to Ansys software. For this purpose, uniform stress in all directions was applied on the con rod. Loading on the rod in Ansys had thre...
متن کاملFinding Weighted Graphs by Combinatorial Search
We consider the problem of finding edges of a hidden weighted graph using a certain type of queries. Let G be a weighted graph with n vertices. In the most general setting, the n vertices are known and no other information about G is given. The problem is finding all edges of G and their weights using additive queries, where, for an additive query, one chooses a set of vertices and asks the sum...
متن کامل